On the Reduction of Chocs Bisimulation to pi-Calculus Bisimulation

Chocs and-calculus are two extensions of CCS where, respectively, processes and channels are transmissible values. In previous work we have proposed a formalization of the notion of bisimulation for Chocs. In this paper we suggest a more eeective way to reason about this notion by means of an embedding of Chocs into a richer calculus endowed with a notion ofàctivation' channel which we christen Chocs t. t is the name of a new internal action which is produced by a synchronization on an activation channel, such a synchronization has the eeect of forcing the execution of an idle process. In rst approximation transitions in Chocs t may be understood as sequences of synchronizations along activation channels followed by anòbservable' transition. There is a simple deenition of bisimulation for Chocs t which satisses natural laws and congruence rules, moreover the synchronization trees associated to Chocs t processes are nitely branching. We propose Chocs t as an intermediate step towards the deenition of a tool for the veriication of Chocs bisimulation.